Statistical Sensitiveness for Science

نویسنده

  • Jose D. Perezgonzalez
چکیده

Research often necessitates of samples, yet obtaining large enough samples is not always possible. When it is, the researcher may use one of two methods for deciding upon the required sample size: rules-of-thumb, quick yet uncertain, and estimations for power, mathematically precise yet with the potential to overestimate or underestimate sample sizes when effect sizes are unknown. Misestimated sample sizes have negative repercussions in the form of increased costs, abandoned projects or abandoned publication of non-significant results. Here I describe a procedure for estimating sample sizes adequate for the testing approach which is most common in the behavioural, social, and biomedical sciences, that of Fisher’s tests of significance. The procedure focuses on a desired minimum effect size for the research at hand and finds the minimum sample size required for capturing such effect size as a statistically significant result. In a similar fashion than power analyses, sensitiveness analyses can also be extended to finding the minimum effect for a given sample size a priori as well as to calculating sensitiveness a posteriori. The article provides a full tutorial for carrying out a sensitiveness analysis, as well as empirical support via simulation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem

This paper investigates output-size sensitiveness of construction of OBDD by analyzing the maximal independent set problem of a graph, which would give several insights to e cient manipulation of Boolean functions by OBDD and graph theory.

متن کامل

Sensitiveness of Evolutionary Algorithms to the Random Number Generator

This article presents an empirical study of the impact of the change of the Random Number Generator over the performance of four Evolutionary Algorithms: Particle Swarm Optimisation, Differential Evolution, Genetic Algorithm and Firefly Algorithm. Random Number Generators are a key piece in the production of e-science, including optimisation problems by Evolutionary Algorithms. However, Random ...

متن کامل

Solving Euler Equations : Classical Methods and the C 1 Contraction Mapping

In this paper we describe the classical methods used to solve the Euler equations. Special attention is devoted to the iterative method based on a contraction mapping derived from these equations in Maldonado and Moreira (2003). We test the numerical robustness of this method when it is used in models with sensitiveness to initial conditions. Finally we extend the method to the case of stochast...

متن کامل

Solving Euler Equations: Classical Methods and the C Contraction Mapping Method Revisited

In this paper we describe the classical methods used to solve the Euler equations. Special attention is devoted to the iterative method based on a contraction mapping derived from these equations in Maldonado and Moreira (2003). We test the numerical robustness of this method when it is used in models with sensitiveness to initial conditions. Finally we extend the method to the case of stochast...

متن کامل

Contextual Grammars versus Natural Languages

We continue here the investigations concerning the relevance of certain classes of contextual grammars (internal contextual grammars with maximal use of selectors) as generative models of natural languages. We discuss the mildly context-sensitiveness property (especially the semilinearity and related properties), the possibility to cover certain constructions speci c to natural languages, as we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016